Fast Image Database Search using Tree-Structured VQ∗
نویسندگان
چکیده
In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, thereby providing a substantially better speed-up versus accuracy tradeoff.
منابع مشابه
Fast Image Database Search Using Tree- Structure VQ
In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, there...
متن کاملFast image search on a VQ compressed image database
A fast and efficient image search method is developed for a compressed image database using vector quantization (VQ). An image search on an image database requires an exhaustive sequential scan of all the images, given the similarity measure. If compressed images are dealt with, images are decompressed as an initial operation and then the previously mentioned exhaustive search is performed usin...
متن کاملAdaptive-search tree-structured residual vector quantization
Full-search vector quantization (VQ) provides optimal results only with high memory and computational cost. We describe the computational and memory requirements of treestructured VQ, residual VQ (RVQ), and tree-structured RVQ. We present multiple-rate, adaptive-search implementations of these VQ structures, and simulation results with video sequences. Tree-structured RVQ provides up to 1.5 db ...
متن کاملImage Vector Quantization with Hierarchical Tree Structure
The tree-structured vector quantization (TSVQ) is an efficient method for the vector quantization (VQ). In this paper, we propose a new tree structure model, hierarchical tree structure (HTS), to reduce encoding time. Briefly, the HTSVQ decreases the dimension of the vector on the upper levels of the codebook tree. If the vector dimension decreases, then the searching time on the codebook tree ...
متن کاملFast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the selected codeword is the closest one to the input vector. Consequently, the image quality of TSVQ is worse than that of full-search VQ (FSVQ). Although researchers have proposed multipath TSVQ and DP-TSVQ to enhance the ...
متن کامل